Joint Unsupervised Learning of Deep Representations and Image Clusters Supplementary materials

نویسندگان

  • Jianwei Yang
  • Devi Parikh
  • Dhruv Batra
  • Virginia Tech
چکیده

This supplementary materials explain some implementation details and present additional experiments that are complementary to our main paper ”Joint Unsupervised Learning of Deep Representations and Image Clusters”. The source code for this work can be downloaded from https://github.com/jwyang/ joint-unsupervised-learning. 1. Affinity Measure for Clusters In this paper, we employ the affinity measure in [13] A(Ci, Cj) = A(Cj → Ci) +A(Ci → Cj) = 1 |Ci| 1T|Ci|WCi,CjWCj ,Ci1|Ci| + 1 |Cj |2 1T|Cj |WCj ,CiWCi,Cj1|Cj | (1) where W is the affinity matrix for samples, and WCi,Cj ∈ R|Ci|×|Cj | is the submatrix in W pointing from samples in Ci to samples in Cj , and WCj ,Ci ∈ R|Cj |×|Ci| is the one pointing from Cj to Ci. 1|Ci| and 1|Cj | are two vectors with all |Ci| and |Cj | elements be 1, respectively. Therefore, we have A(Ci, Cj) = A(Cj , Ci). According to (1), we can derive A((Cm ∪ Cn)→ Ci) = A(Cm → Ci) +A(Cn → Ci) (2) which has also been shown in [13]. Meanwhile, A(Ci → (Cm ∪ Cn)) = β1T|Cm|+|Cn|WCm∪Cn,CiWCi,Cm∪Cn1|Cm|+|Cn| = β1T|Cm|WCm,CiWCi,Cm1|Cm| + β1 T |Cn|WCn,CiWCi,Cn1|Cn| + β1T|Cm|WCm,CiWCi,Cn1|Cn| + β1 T |Cn|WCn,CiWCi,Cm1|Cm| (3) where β = 1/(|Cm|+ |Cn|). 2. Approximated Affinity Measure During agglomerative clustering, we need to re-compute the affinity between the merged cluster to all other clusters based on 2 and 3 repeatedly. It is simple to compute 2. However, to get A(Ci → (Cm∪Cn)), we need a lot of computations. These time costs become dominant and remarkable when we have a large-scale dataset. To accelerate the computations, we introduce an approximation method. At the right side of (3), we assume samples in Cm and Cn have similar affinities to Ci. This assumption is mild because the condition to merge Cm and Cn is that they are similar to each other. In this case, the ratio betweenWCi,Cm1|Cm| and WCi,Cn1|Cn| is analogy to the ratio between the number of samples in two set, i.e., WCi,Cm1|Cm| = |Cm| |Cn| WCi,Cn1|Cn| (4) Based on (4), we can re-formulate (3) to

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Unsupervised Domain Adaptation for Image Classification via Low Rank Representation Learning

Domain adaptation is a powerful technique given a wide amount of labeled data from similar attributes in different domains. In real-world applications, there is a huge number of data but almost more of them are unlabeled. It is effective in image classification where it is expensive and time-consuming to obtain adequate label data. We propose a novel method named DALRRL, which consists of deep ...

متن کامل

Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks

In recent years, supervised learning with convolutional networks (CNNs) has seen huge adoption in computer vision applications. Comparatively, unsupervised learning with CNNs has received less attention. In this work we hope to help bridge the gap between the success of CNNs for supervised learning and unsupervised learning. We introduce a class of CNNs called deep convolutional generative adve...

متن کامل

Image Classification via Sparse Representation and Subspace Alignment

Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...

متن کامل

Multimodal sparse representation learning and applications

Unsupervised methods have proven effective for discriminative tasks in a singlemodality scenario. In this paper, we present a multimodal framework for learning sparse representations that can capture semantic correlation between modalities. The framework can model relationships at a higher level by forcing the shared sparse representation. In particular, we propose the use of joint dictionary l...

متن کامل

Assisting the training of deep neural networks with applications to computer vision

Deep learning has recently been enjoying an increasing popularity due to its success in solving challenging tasks. In particular, deep learning has proven to be effective in a large variety of computer vision tasks, such as image classification, object recognition and image parsing. Contrary to previous research, which required engineered feature representations, designed by experts, in order t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016